def fib_naive(n):
    print("斐波那契函数调用")
    if n <= 1:
        return n
    return fib_naive(n-1) + fib_naive(n-2)

# 测试
print("递归方法：")
for i in range(10):
    print(f"F({i}) = {fib_naive(i)}")